Symbolic Dynamics in Free Profinite Semigroups
نویسنده
چکیده
This is a survey and announcement of recent results on the structure of free profinite semigroups using techniques and results from symbolic dynamics. The intimate connection between uniformly recurrent infinite words and J -maximal regular J -classes is explored to compute the maximal subgroups of the J -classes associated with Arnoux-Rauzy infinite words, which turn out to be free profinite groups whose rank is the number of letters involved.
منابع مشابه
Profinite semigroups
We present a survey of results on profinite semigroups and their link with symbolic dynamics. We develop a series of results, mostly due to Almeida and Costa and we also include some original results on the Schützenberger groups associated to a uniformly recurrent set.
متن کاملSubword Complexity of Profinite Words and Subgroups of Free Profinite Semigroups
We study free profinite subgroups of free profinite semigroups of the same rank using, as main tools, iterated implicit operators, subword complexity and the associated entropy.
متن کاملProfinite Structures and Dynamics
Surprising as it may be at first sight, there are a number of connections between the theories of finite semigroups and dynamical systems, both viewed in a broad sense. For instance in symbolic dynamics, ideas or analogies from the theory of finite automata find a natural setting for application in sofic systems [10, 24] and, even though not usually formulated in dynamical terms, the dynamical ...
متن کاملProfinite semigroups and applications∗
Profinite semigroups may be described shortly as projective limits of finite semigroups. They come about naturally by studying pseudovarieties of finite semigroups which in turn serve as a classifying tool for rational languages. Of particular relevance are relatively free profinite semigroups which for pseudovarieties play the role of free algebras in the theory of varieties. Combinatorial pro...
متن کاملInfinite-vertex Free Profinite Semigroupoids and Symbolic Dynamics
Some fundamental questions about infinite-vertex (free) profinite semigroupoids are clarified, putting in evidence differences with the finitevertex case. This is done with examples of free profinite semigroupoids generated by the graph of a subshift. It is also proved that for minimal subshifts, the infinite edges of such free profinite semigroupoids form a connected compact groupoid.
متن کامل